Iterated Runge–Kutta Methods on Parallel Computers
نویسندگان
چکیده
منابع مشابه
Parallel Iterated Runge Kutta Methods and Applications
The iterated Runge Kutta IRK method is an iteration scheme for the numerical solu tion of initial value problems IVP of ordinary di erential equations ODEs that is based on a predictor corrector method with an Runge Kutta RK method as corrector Embed ded approximation formulae are used to control the stepsize We present di erent parallel algorithms of the IRK method on distributed memory multip...
متن کاملEffective order strong stability preserving RungeKutta methods
We apply the concept of effective order to strong stability preserving (SSP) explicit Runge–Kutta methods. Relative to classical Runge–Kutta methods, effective order methods are designed to satisfy a relaxed set of order conditions, but yield higher order accuracy when composed with special starting and stopping methods. The relaxed order conditions allow for greater freedom in the design of ef...
متن کاملCommunication Cost Reduction for Krylov Methods on Parallel Computers
On large distributed memory parallel computers the global communication cost of inner products seriously limits the performance of Krylov subspace methods We consider improved algorithms to reduce this communication overhead and we analyze the performance by experiments on a processor parallel computer and with a simple performance model
متن کاملMultigrid Methods for Computational Acoustics on Vector and Parallel Computers
We consider the parabolic approximation to the three{dimensional Helmholtz equation for the acoustic pressure. The parabolic equation is semi{discretized in the range variable using an implicit scheme (e.g., Crank{Nicolson). This leads to a complex elliptic partial di erential equation that must be solved at each range step. We use a multigrid method to solve this partial di erential equation, ...
متن کاملA Critical Analysis of Multigrid Methods on Massively Parallel Computers
The hierarchical nature of multigrid algorithms leaves domain parallel strategies with a de ciency of parallelism as the computation moves to coarser and coarser grids. To introduce more parallelism several strategies have been designed to project the original problem space into non-interfering subspaces, allowing all grids to relax concurrently. Our objective is to understand the potential e c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific and Statistical Computing
سال: 1991
ISSN: 0196-5204,2168-3417
DOI: 10.1137/0912054